T-choosability in graphs
نویسندگان
چکیده
منابع مشابه
T-choosability in Graphs
Given a set of nonnegative integers T , and a function S which assigns a set of integers S(v) to each vertex v of a graph G, an S-list T -coloring c of G is a vertexcoloring (with positive integers) of G such that c(v) ∈ S(v) whenever v ∈ V (G) and |c(u)− c(w)| 6∈ T whenever (u,w) ∈ E(G). For a fixed T , the T -choice number T -ch(G) of a graph G is the smallest number k such that G has an S-li...
متن کاملOn (k, t)-choosability of graphs
A k-list assignment L of a graph G is a mapping which assigns to each vertex v of G a set L(v) of size k. A (k,t)-list assignment of G is a k-list assignment with | ⋃ v∈V (G) L(v)| = t. An L-coloring φ of G is a proper coloring of G such that φ(v) is chosen from L(v) for every vertex v. A graph G is Lcolorable if G has an L-coloring. When the parameter t is not of special interest, we simply sa...
متن کاملChoosability, Edge Choosability, and Total Choosability of Outerplane Graphs
Let χl (G), χ ′ l (G), χ ′′ l (G), and 1(G) denote, respectively, the list chromatic number, the list chromatic index, the list total chromatic number, and the maximum degree of a non-trivial connected outerplane graph G. We prove the following results. (1) 2 ≤ χl (G) ≤ 3 and χl (G) = 2 if and only if G is bipartite with at most one cycle. (2) 1(G) ≤ χ ′ l (G) ≤ 1(G) + 1 and χ ′ l (G) = 1(G) + ...
متن کاملChoosability in signed planar graphs
This paper studies the choosability of signed planar graphs. We prove that every signed planar graph is 5-choosable and that there is a signed planar graph which is not 4-choosable while the unsigned graph is 4-choosable. For each k ∈ {3, 4, 5, 6}, every signed planar graph without circuits of length k is 4-choosable. Furthermore, every signed planar graph without circuits of length 3 and of le...
متن کاملIncidence Choosability of Graphs
An incidence of a graph G is a pair (v, e) where v is a vertex of G and e is an edge of G incident with v. Two incidences (v, e) and (w, f) of G are adjacent whenever (i) v = w, or (ii) e = f , or (iii) vw = e or f . An incidence p-colouring of G is a mapping from the set of incidences of G to the set of colours {1, . . . , p} such that every two adjacent incidences receive distinct colours. In...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1998
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(97)00124-8